A Deadlock-Free Wormhole Routing Scheme in the Pan-Mesh
نویسندگان
چکیده
In this paper, we propose a deadlock-free wormhole routing scheme called the Zigzag routing for the panMesh, which generalizes the mesh topology. Accordingly, we prove that only two virtual channels are needed for deadlock-freeness on every physical channel by using the Zigzag routing.
منابع مشابه
Deadlock - Free : Fault Tolerant Wormhole Routing in Mesh based Massively Parallel Systems *
In this paper we present a routing scheme which is extremely suited for use in massively parallel systems . The routing algorithm is fault-tolerant so that network failures will not stop the system. For reasons of scalability, the routing information is extremely compact, also when the network is injured . The wormhole routing technique guarantees very low routing latency . Moreover the routing...
متن کاملAdaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers
The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...
متن کاملDeadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hyper-cube multicomputer, provides hardware support for broadcast and a re...
متن کاملAdaptive Multicast Wormhole Routing in 2D Mesh Multicomputers
We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کامل